Configuration Management Through Satisfiability
نویسندگان
چکیده
منابع مشابه
Event Calculus Planning Through Satisfiability
Previous work on event calculus planning has viewed it as an abductive task, whose implementation through abductive logic programming reduces to partial order planning. By contrast, this paper presents a formal framework for tackling event calculus planning through satisfiability, in the style of Kautz and Selman. A provably correct conjunctive normal form encoding for event calculus planning p...
متن کاملSimplifying System Management Through Automated Forecasting, Diagnosis, and Configuration Tuning
Simplifying System Management Through Automated Forecasting, Diagnosis, and Configuration Tuning by Songyun Duan Department of Computer Science Duke University
متن کاملEvent Calculus Reasoning Through Satisfiability
We present an implemented method for encoding reasoning problems of a discrete version of the classical logic event calculus in propositional conjunctive normal form, enabling the problems to be solved efficiently by off-the-shelf complete satisfiability (SAT) solvers. We build on the previous encoding method of Shanahan and Witkowski, extending it to support causal constraints, concurrent even...
متن کاملExtending Routers Utilisability and Life Cycle through Automated Configuration Management
We present the design of a distributed router platform aimed at consolidating multiple hardware routers. The goal of the approach is twofold: firstly decouple the logical routing and forwarding functionality from the limitations of the hardware that runs it, through automated configuration management only; and secondly, give component routers a longer lease of life, as constituting parts of a l...
متن کاملVLSI Circuit Configuration Using Satisfiability Logic in Hopfield Network
Very large scale integration (VLSI) circuit comprises of integrated circuit (IC) with transistors in a single chip, widely used in many sophisticated electronic devices. In our paper, we proposed VLSI circuit design by implementing satisfiability problem in Hopfield neural network as circuit verification technique. We restrict our logic construction to 2-Satisfiability (2-SAT) and 3Satisfiabili...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia CIRP
سال: 2016
ISSN: 2212-8271
DOI: 10.1016/j.procir.2016.02.127